/*
 * @lc app=leetcode.cn id=674 lang=javascript
 *
 * [674] 最长连续递增序列
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @return {number}
 */
var findLengthOfLCIS = function(nums) {
    if(nums.length==0)return 0
    let max=1,i=0,count=1
    while(i<nums.length-1){
        if(nums[i+1]>nums[i]){
            count++
        }else{
            max=Math.max(count,max)
            count=1
        }
        i++
    }
    max=Math.max(max,count)
    return max
};
// @lc code=end

